Learning Read-Constant Polynomials of Constant Degree Modulo Composites
نویسندگان
چکیده
منابع مشابه
Learning Read-constant Polynomials of Constant Degree over Arbitrary Moduli
Boolean functions that have constant-degree polynomial representation over a fixed finite ring form a natural and strict subclass of the complexity class ACC. They are also precisely the functions computable efficiently by programs over fixed and finite nilpotent groups. This class is not known to be learnable in any reasonable learning model. In this paper, we provide a deterministic polynomia...
متن کاملMonotone separations for constant degree polynomials
We prove a separation between monotone and general arithmetic formulas for polynomials of constant degree. We give an example of a polynomial C in n variables and degree k which is computable by a homogeneous arithmetic formula of size O(k2n2), but every monotone formula computing C requires size (n/kc)Ω(log k), with c ∈ (0, 1). Since the upper bound is achieved by a homogeneous arithmetic form...
متن کاملBivariate Polynomials Modulo Composites and Their Applications
We investigate the hardness of finding solutions to bivariate polynomial congruences modulo RSA composites. We establish necessary conditions for a bivariate polynomial to be one-way, second preimage resistant, and collision resistant based on arithmetic properties of the polynomial. From these conditions we deduce a new computational assumption that implies an efficient algebraic collision-res...
متن کاملMonotone separations for constant degree
We prove a separation between monotone and general arithmetic formulas for polynomials of constant degree. We give an example of a polynomial C in n variables and degree k which is computable by an arithmetic formula of size O(k2n2), but every monotone formula computing C requires size (n/kc)Ω(log k), with c ∈ (0, 1). This also gives a separation between monotone and homogeneous formulas, for p...
متن کاملPseudorandomness for Read-Once, Constant-Depth Circuits
For Boolean functions computed by read-once, depth-D circuits with unbounded fan-in over the de Morgan basis, we present an explicit pseudorandom generator with seed length Õ(log n). The previous best seed length known for this model was Õ(log n), obtained by Trevisan and Xue (CCC ‘13 ) for all of AC (not just read-once). Our work makes use of Fourier analytic techniques for pseudorandomness in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory of Computing Systems
سال: 2013
ISSN: 1432-4350,1433-0490
DOI: 10.1007/s00224-013-9488-6